Waiting time and queue length analysis of Markov-modulated fluid priority queues

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete-time Priority Queues with Two-state Markov Modulated Arrivals

A class of discrete-time priority queueing systems with Markov modulated arrivals is considered. In these systems, N queues are served by a single server according to priorities that are preassigned to the queues. Packet arrivals are modeled as discrete-time batch processes with a distribution that depends on the state of an independent common two-state Markov chain. This allows to cover a wide...

متن کامل

Markov-modulated and feedback fluid queues

Contents Voorwoord v Contents vii 1 Introduction 1 1.

متن کامل

Moments of a Markov-modulated, Irreducible Network of Fluid Queues

We study a network of fluid queues in which exogenous arrivals are modulated by a continuous-timeMarkov chain. Service rates in each queue are proportional to the queue size, and the network is assumed to be irreducible. Thequeue levels satisfy a linear, vectorvalued differential equation. We obtain joint moments of the queue sizes recursively, and deduce the Laplace transform of the queue size...

متن کامل

Tail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues

We consider the problem of estimating tail probabilities of waiting times in statistical multiplexing systems with two classes of sources { one with high priority and the other with low priority. The priority discipline is assumed to be nonpreemptive. Exact expressions for the transforms of these quantities are derived assuming that packet or cell streams are generated by Markovian Arrival Proc...

متن کامل

Queue Length Analysis of a Markov-modulated Vacation Queue with Dependent Arrival and Service Processes and Exhaustive Service Policy

The paper introduces a class of vacation queues where the arrival and service processes are modulated by the same Markov process, hence they can be dependent. The main result of the paper is the probability generating function for the number of jobs in the system. The analysis follows a matrix-analytic approach. A step of the analysis requires the evaluation of the busy period of a quasi birth ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Queueing Systems

سال: 2020

ISSN: 0257-0130,1572-9443

DOI: 10.1007/s11134-020-09650-2